Optimum Wordlength Search Using Sensitivity Information
نویسندگان
چکیده
منابع مشابه
Optimum Wordlength Search Using Sensitivity Information
Many digital signal processing algorithms are first developed in floating point and later converted into fixed point for digital hardware implementation. During this conversion, more than 50% of the design time may be spent for complex designs, and optimum wordlengths are searched by trading off hardware complexity for arithmetic precision at system outputs. We propose a fast algorithm for sear...
متن کاملOptimum Wordlength Allocation
This paper presents an approach to the wordlength allocation and optimization problem for linear digital signal processing systems implemented in Field-Programmable Gate Arrays. The proposed technique guarantees an optimum set of wordlengths for each internal variable, allowing the user to trade-off implementation area for error at system outputs. Optimality is guaranteed through modelling as a...
متن کاملComparison of Optimum and Square Blanks Using the Sensitivity Approach
paper studies the modified sensitivity analysis applied into an elastic-plastic finite element analysis of a 3D blank design in sheet metal forming. Originally the sensitivity method has successfully been applied to several arbitrary shapes. In the present paper the sensitivity coefficients are not considered constant during the analysis. The presented approach computes the new coefficients fro...
متن کاملDesign of optimum high-order finite-wordlength digital FIR filters with linear phase
A novel iterative quantization procedure for the design of finite wordlength linear phase FIR filters of high order and minimum frequency domain error is proposed: a one by one increased number of filter coefficients is quantized where the augmented frequency domain error is re-minimized in each case. This new approach achieves a smaller frequency domain error than rounding of the optimal non-q...
متن کاملFAMOUS: Fast Approximate string Matching using OptimUm search Schemes
Finding approximate occurrences of a pattern in a text using a full-text index is a central problem in bioinformatics and has been extensively researched. The introduction of practical bidirectional indices has opened new possibilities for solving the problem as they allow the search to be started from anywhere within the pattern and extended in both directions. In particular, use of search sch...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: EURASIP Journal on Advances in Signal Processing
سال: 2006
ISSN: 1687-6180
DOI: 10.1155/asp/2006/92849